Multiweight optimization in OBE algorithms for improved tracking and adaptive identification
نویسندگان
چکیده
Optimal Bounding Ellipsoid (OBE) algorithms offer an attractive alternative to traditional least squares methods for identifying linear-in-parameters signal and system models due to their low computational efficiency, superior tracking ability, and selective updating that permits processor sharing among tasks. These benefits are further enhanced by multiweight optimization (MWO) which yields improved per-point parameter convergence. This paper introduces the MWO process and describes advances in its implementation including the incorporation of a forgetting factor for improved tracking, a new method for efficient weight computation, and extensions to volume-minimizing OBE algorithms. Simulation studies illustrate the results.
منابع مشابه
Designing an adaptive fuzzy control for robot manipulators using PSO
This paper presents designing an optimal adaptive controller for tracking control of robot manipulators based on particle swarm optimization (PSO) algorithm. PSO algorithm has been employed to optimize parameters of the controller and hence to minimize the integral square of errors (ISE) as a performance criteria. In this paper, an improved PSO using logic is proposed to increase the convergenc...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملModified quasi-OBE algorithm with improved numerical properties
The quasi-OBE (QOBE) algorithm is a set-membership adaptive filtering algorithm based on the principles of optimal bounding ellipsoid (OBE) processing. This algorithm can provide enhanced convergence and tracking performance as well as reduced average computational complexity in comparison with the more traditional adaptive filtering algorithms such as the recursive leastsquares (RLS) algorithm...
متن کاملPareto design of fuzzy tracking control based on the particle swarm optimization algorithm for a walking robot in the lateral plane on slope
Many researchers have controlled and analyzed biped robots that walk in the sagittal plane. Nevertheless, walking robots require the capability to walk merely laterally, when they are faced with the obstacles such as a wall. In walking robot field, both nonlinearity of the dynamic equations and also having a tracking system cause an effective control has to be utilized to address these problems...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کامل